Goal Oriented Equational Theorem Proving Using Team Work

نویسندگان

  • Jörg Denzinger
  • Matthias Fuchs
چکیده

The team work method is a concept for distributing automated theorem provers and so to activate several experts to work on a given problem. We have implemented this for pure equational logic using the unfailing Knuth-Bendix completion procedure as basic prover. In this paper we present three classes of experts working in a goal oriented fashion. In general, goal oriented experts perform their job "unfair" and so are often unable to solve a given problem alone. However, as a team member in the team work method they perform highly ee-cient, even in comparison with such respected provers as Otter 3.0 or REVEAL, as we demonstrate by examples, some of which can only be proved using team work. The reason for these achievements results from the fact that the team work method forces the experts to compete for a while and then to cooperate by exchanging their best results. This allows one to collect "good" intermediate results and to forget "useless" ones. Completion based proof methods are frequently regarded to have the disadvantage of being not goal oriented. We believe that our approach overcomes this disadvantage to a large extend.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The application of goal - oriented heuristics for proving equational theorems via the unfailing Knuth - Bendix completion procedure

In this report we present a case study of employing goal-oriented heuristics when proving equational theorems with the (unfailing) Knuth-Bendix completion procedure. The theorems are taken from the domain of lattice ordered groups. It will be demonstrated that goal-oriented (heuristic) criteria for selecting the next critical pair can in many cases significantly reduce the search effort and hen...

متن کامل

Distributing Equational Theorem Proving 1

In this paper we show that distributing the theorem proving task to several experts is a promising idea. We describe the team work method which allows the experts to compete for a while and then to cooperate. In the cooperation phase the best results derived in the competition phase are collected and the less important results are forgotten. We describe some useful experts and explain in detail...

متن کامل

Using Rippling for Equational Reasoning

This paper presents techniques to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use annotated terms to represent syntactical diierences of formulas. Based on these annotations and on hierarchies of function symbols we deene diierent abstractions of formulas which are used for planning of proofs. Rippling tec...

متن کامل

Towards a Foundation of Completion Procedures as Semidecision Procedures

Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for equational theories. In this paper we present a new abstract framework for the utilization of completion procedures as semidecision procedures for theorem proving. The key idea in our approach is that a semidecision proce...

متن کامل

Narrowing and Rewriting Logic: from Foundations to Applications

Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both cases, narrowing supports equational reasoning and assumes confluent equations. The main goal of this work is to show that narrowing can be greatly generalized, so as to support a much wider range of applications, when ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994